-
1 matrix factorization
Англо-русский словарь промышленной и научной лексики > matrix factorization
-
2 факторизация матрицы
-
3 факторизация матрицы
Русско-английский научно-технический словарь Масловского > факторизация матрицы
-
4 факторизация матрицы
1) Engineering: matrix factorization2) Mathematics: factorization of matrixУниверсальный русско-английский словарь > факторизация матрицы
-
5 Определенные артикли перед существительными, которые снабжены ссылками
The differential problem (1) can be reduced to the form (2)The asymptotic formula (1) follows from the above lemmaThe differential equation (1) can be solved numericallyWhat is needed in the final result is a simple bound on quantities of the form (1)The inequality (1) (артикль можно опустить) shows that $a>b$The bound (estimate) (2) is not quite as good as the bound (estimate) (1)If the norm of $A$ satisfies the restriction (1), then by the estimate (2) this term is less than unitySince the spectral radius of $A$ belongs to the region (1), this iterative method converges for any initial guessesThe array (1) is called the matrix representing the linear transformation of $f$It should be noted that the approximate inequality (1) bounds only the absolute error in $x$The inequality (1) shows that...The second step in our analysis is to substitute the forms (1) and (2) into this equation and simplify it by dropping higher-order termsFor small $ze$ the approximation (1) is very good indeedA matrix of the form (1), in which some eigenvalue appears in more than one block, is called a derogatory matrixThe relation between limits and norms is suggested by the equivalence (1)For this reason the matrix norm (1) is seldom encountered in the literatureTo establish the inequality (1) from the definition (2)Our conclusion agrees with the estimate (1)The characterization is established in almost the same way as the results of Theorem 1, except that the relations (1) and (2) take place in the eigenvalue-eigenvector relation...This vector satisfies the differential equation (1)The Euclidean vector norm (2) satisfies the properties (1)The bound (1) ensures only that these elements are small compared with the largest element of $A$There is some terminology associated with the system (1) and the matrix equation (2)A unique solution expressible in the form (1) restricts the dimensions of $A$The factorization (1) is called the $LU$-factorizationIt is very uncommon for the condition (1) to be violatedThe relation (1) guarantees that the computed solution gives very small residualThis conclusion follows from the assumptions (1) and (2)The factor (1) introduced in relation (2) is now equal to 2The inequalities (1) are still adequateWe use this result without explicitly referring to the restriction (1)Русско-английский словарь по прикладной математике и механике > Определенные артикли перед существительными, которые снабжены ссылками
-
6 Неблочный
An unblocked version of a block-partitioned algorithmThis subroutine computes (performs) a $QR$-factorization with (без артикля) column (row) pivoting of a general rectangular matrixThis subroutine computes (performs) an $LU$-factorization of a general band matrix, using (без артикля) partial pivoting with row (column) interchangesРусско-английский словарь по прикладной математике и механике > Неблочный
-
7 Приводить матрицу к виду
This subroutine reduces a general rectangular matrix to (без артикля) real bidiagonal form (to upper Hessenberg form) by an orthogonal transformationThis subroutine computes the Cholesky factorization of a symmetric positive definite band (banded) matrixРусско-английский словарь по прикладной математике и механике > Приводить матрицу к виду
-
8 разложение матрицы на множители
Makarov: matrix factorizationУниверсальный русско-английский словарь > разложение матрицы на множители
-
9 Без выбора ведущего элемента
This subroutine computes an $LU$-factorization of a general tridiagonal matrix with no pivotingРусско-английский словарь по прикладной математике и механике > Без выбора ведущего элемента
-
10 Однозначно определен
The factorization $A=LU$ is uniquely defined if...The elements of the matrix $A$ are uniquely determined by formulas (1) and (2)Русско-английский словарь по прикладной математике и механике > Однозначно определен
-
11 Частичный выбор ведущего элемента
This subroutine computes (performs) an $LU$-factorization of a general band matrix, using (без артикля) partial pivoting with row (column) interchangesРусско-английский словарь по прикладной математике и механике > Частичный выбор ведущего элемента
См. также в других словарях:
Matrix theory — is a branch of mathematics which focuses on the study of matrices. Initially a sub branch of linear algebra, it has grown to cover subjects related to graph theory, algebra, combinatorics, and statistics as well.HistoryThe term matrix was first… … Wikipedia
Matrix decomposition — In the mathematical discipline of linear algebra, a matrix decomposition is a factorization of a matrix into some canonical form. There are many different matrix decompositions; each finds use among a particular class of problems. Contents 1… … Wikipedia
Factorization — This article is about the mathematical concept. For other uses, see Factor and Integer factorization. A visual illustration of the polynomial x2 + cx + d = (x + a)(x + b) where… … Wikipedia
Matrix differential equation — A differential equation is a mathematical equation for an unknown function of one or several variables that relates the values of the function itself and of its derivatives of various orders. A matrix differential equation is one containing more… … Wikipedia
Non-negative matrix factorization — NMF redirects here. For the bridge convention, see new minor forcing. Non negative matrix factorization (NMF) is a group of algorithms in multivariate analysis and linear algebra where a matrix, , is factorized into (usually) two matrices, and… … Wikipedia
Dixon's factorization method — In number theory, Dixon s factorization method (also Dixon s random squares method[1] or Dixon s algorithm) is a general purpose integer factorization algorithm; it is the prototypical factor base method, and the only factor base method for which … Wikipedia
Incomplete Cholesky factorization — In numerical analysis, a field within mathematics, an incomplete Cholesky factorization of a symmetric positive definite matrix is a sparse approximation of the Cholesky factorization. Incomplete Cholesky factorization are often used as a… … Wikipedia
Integer factorization — In number theory, integer factorization is the way of breaking down a composite number into smaller non trivial divisors, which when multiplied together equal the original integer.When the numbers are very large, no efficient integer… … Wikipedia
Positive-definite matrix — In linear algebra, a positive definite matrix is a matrix that in many ways is analogous to a positive real number. The notion is closely related to a positive definite symmetric bilinear form (or a sesquilinear form in the complex case). The… … Wikipedia
Rotation matrix — In linear algebra, a rotation matrix is a matrix that is used to perform a rotation in Euclidean space. For example the matrix rotates points in the xy Cartesian plane counterclockwise through an angle θ about the origin of the Cartesian… … Wikipedia
M-matrix — In mathematics, especially linear algebra, an M matrix is a Z matrix with eigenvalues whose real parts are positive. M matrices are a subset of the class of P matrices, and also of the class of inverse positive matrices [Takao Fujimoto and… … Wikipedia
